/*
 * Copyright (C) 2011 JiangHongTiao <jjurco.sk_gmail.com>
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
package sk.lieskove301.jianghongtiao.liaad.prisoner.ga.mutation;

import java.util.Random;
import sk.lieskove301.jianghongtiao.liaad.prisoner.agent.Agent;
import sk.lieskove301.jianghongtiao.liaad.prisoner.gene.GeneEnum;
import sk.lieskove301.jianghongtiao.liaad.prisoner.gene.GeneticInfo;
import sk.lieskove301.jianghongtiao.liaad.prisoner.memory.ForgettingEnum;

/**
 * Randomly change random chromosomes
 * Date of create: May 26, 2011
 *
 * @author JiangHongTiao <jjurco.sk_gmail.com>
 * @version 2011.0526
 */
public class RandomMutation implements Mutation {
    
    private Random rand = new Random();
    private double randPst = 0.15;
    private int numOfGenes = 8;
    private double pstOfChange = randPst / numOfGenes;

    public Agent modify(Agent agent, GeneEnum[] possibleGenes,
            ForgettingEnum[] possibleForgetting) {
        Agent result = agent.copyAgent();
        GeneEnum[] gene = result.getGene().getGene();
        for (int i = 0; i < 5; i++) {
            if(rand.nextDouble() < pstOfChange){
                gene[i] = possibleGenes[rand.nextInt(possibleGenes.length)];
            }
        }
        if(rand.nextDouble() < pstOfChange){
            result.setForgetting(possibleForgetting[rand.nextInt(possibleForgetting.length)]);
        }
        if(rand.nextDouble() < pstOfChange){
            result.setInvert(rand.nextBoolean());
        }
        if(rand.nextDouble() < pstOfChange){
            result.setOptimistic(rand.nextBoolean());
        }
        result.setGene(new GeneticInfo(gene));
        return result;
    }
    
}
